Stability analysis of diagonally equipotent matrices
نویسنده
چکیده
Diagonally equipotent matrices are diagonally dominant matrices for which dominance is never strict in any coordinate. They appear e.g. as Laplacian matrices of signed graphs. We show in this paper that for this class of matrices it is possible to provide a complete characterization of the stability properties based only on the signs of the entries of the matrices.
منابع مشابه
Tight bounds on the infinity norm of inverses of symmetric diagonally dominant positive matrices
We prove tight bounds for the ∞-norm of the inverse of symmetric diagonally dominant positive matrices. Applications include numerical stability for linear systems, bounds on inverses of differentiable functions, and the consistency of maximum entropy graph distributions from single samples.
متن کاملInverses of symmetric, diagonally dominant positive matrices and applications
We prove tight bounds for the ∞-norm of the inverse of a symmetric, diagonally dominant positive matrix J ; in particular, we show that ‖J‖∞ is uniquely maximized among all such J . We also prove a new lower-bound form of Hadamard’s inequality for the determinant of diagonally dominant positive matrices and an improved upper bound for diagonally balanced positive matrices. Applications of our r...
متن کاملStability of the Levinson Algorithm for Toeplitz-Like Systems
Numerical stability of the Levinson algorithm, generalized for Toeplitz-like systems, is studied. Arguments based on the analytic results of an error analysis for floating point arithmetic produce an upper bound on the norm of the residual vector, which grows exponentially with respect to the size of the problem. The base of such an exponential function can be small for diagonally dominant Toep...
متن کاملThe Supremum and Stability of Weighted Pseudoinverses
During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O'Leary obtained an upper bound for scaled pseudoinverses sup W2P k(W 1 2 X) + W 1 2 k 2 of a matrix X where P is a set of diagonal positive deenite matrices. We improved their results to obtain the ...
متن کاملGeneralizations of Diagonal Dominance in Matrix Theory
A matrix A ∈ C is called generalized diagonally dominant or, more commonly, an H−matrix if there is a positive vector x = (x1, · · · , xn) such that |aii|xi > ∑ j 6=i |aij|xj, i = 1, 2, · · · , n. In this thesis, we first give an efficient iterative algorithm to calculate the vector x for a given H-matrix, and show that this algorithm can be used effectively as a criterion for H-matrices. When ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 49 شماره
صفحات -
تاریخ انتشار 2013